Strong external difference families in abelian and non-abelian groups

Abstract Strong external difference families (SEDFs) have applications to cryptography and are rich combinatorial structures in their own right. We extend the definition of SEDF from abelian groups all finite groups, introduce concept equivalence. prove new recursive constructions for SEDFs generalized (GSEDFs) cyclic present first family non-abelian SEDFs. there exist at least two non-equivalent ( k 2 + 1,2, ,1)-SEDFs every > 2, begin task enumerating SEDFs, via a computational approach which yields complete results up order 24.